Posets for Conngurations!

We deene families of posets, ordered by preexes, as the counterpart of the usual families of conngurations ordered by subsets. On these objects we deene two types of morphism: event and order morphisms, resulting in categories FPos and FPos v. We then show the following: { Families of posets, in contrast to families of conngurations, are always prime algebraic; in fact the category FPos v is equivalent to the category of prime algebraic domains; { On the level of events, FPos is equivalent to the category of prime algebraic domains with an additional relation encoding event identity. { The (abstract) event identity relation can be used to characterize concrete relations between events such as binary connict and causal ow; { One can characterize a wide range of event-based models existing in the literature as families of posets satisfying certain speciic structural conditions formulated in terms of event identity.